منابع مشابه
A note on general sliding window processes
Let f : R → [r] = {1, 2, . . . , r} be a measurable function, and let {Ui}i∈N be a sequence of i.i.d. random variables. Consider the random process Zi = f(Ui, ..., Ui+k−1). We show that for all q, there is a positive probability, uniform in f , that Z1 = Z2 = ... = Zq. A continuous counterpart is that if f : R → R, and Ui and Zi are as before, then there is a positive probability, uniform in f ...
متن کاملGeneral Incremental Sliding-Window Aggregation
Stream processing is gaining importance as more data becomes available in the form of continuous streams and companies compete to promptly extract insights from them. In such applications, sliding-window aggregation is a central operator, and incremental aggregation helps avoid the performance penalty of re-aggregating from scratch for each window change. This paper presents Reactive Aggregator...
متن کاملA Note on the Signed Sliding Window Integer Recoding and a Left-to-Right Analogue
Addition-subtraction-chains obtained from signed digit recodings of integers are a common tool for computing multiples of random elements of a group where the computation of inverses is a fast operation. Cohen and Solinas independently described one such recoding, the w-NAF. For scalars of the size commonly used in cryptographic applications, it leads to the current scalar multiplication algori...
متن کاملSliding Window Logic Simulation
Existing digital logic simulators typically depend on a discrete-time model of circuit behaviour. Whilst this approach is sufficient in many cases for the validation of the behaviour of synchronous circuits, it is not good at identifying glitches that are narrower than the available time resolution. Moreover, it is not generally feasible to accommodate uncertainty in delay time in such a way as...
متن کاملOn Sliding Window Schemes For DiscreteLeast
Fast, eecient, and reliable algorithms for up-and downdating discrete least-squares approximations of a real-valued function given at arbitrary distinct nodes in 0; 2) by trigonometric polynomials are presented. A combination of the up-and downdating algorithms yields a sliding window scheme. The algorithms are based on schemes for the solution of (inverse) unitary eigenproblems and require onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2014
ISSN: 1083-589X
DOI: 10.1214/ecp.v19-3341